Graph Embedding with Topological Cycle-Constraints
نویسنده
چکیده
This paper concerns graph embedding under topological constraints. We address the problem of nding a planar embedding of a graph satisfying a set of constraints between its vertices and cycles that require embedding a given vertex inside its corresponding cycle. This problem turns out to be NP-complete. However, towards an analysis of its tractable subproblems, we develop an eecient algorithm for the special case where graphs are 2-connected and any two distinct cycles in the constraints have at most one vertex in common.
منابع مشابه
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cycle of the given graph and a set of its edges to be embedded inside this cycle and a set of its edges to be embedded outside this cycle. Their practical importance in graph visualization applications is due to the capa...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملRule-based transformations for geometric modelling
The context of this paper is the use of formal methods for topology-based geometric modelling. Topology-based geometric modelling deals with objects of various dimensions and shapes. Usually, objects are defined by a graph-based topological data structure and by an embedding that associates each topological element (vertex, edge, face, etc.) with relevant data as their geometric shape (position...
متن کاملCosets, voltages, and derived embeddings
An ordinary voltage graph embedding in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph G in a surface with voltage group A and a connected subgraph H of G, we define special subgroups of A that depend on H and show how cosets of these groups in A can be used to find topological information concerning the d...
متن کاملClosed 2-cell embeddings of 4 cross-cap embeddable graphs
The strong embedding conjecture states that every 2-connected graph has a closed 2-cell embedding in some surface , i . e . an embedding that each face is bounded by a circuit in the graph . A graph is called k -crosscap embeddable if it can be embedded in the surface of non-orientable genus k . We confirm the strong embedding conjecture for 5-crosscap embeddable graphs . As a corollary , every...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999